package practice1_100;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class Practice310 {
    public List<Integer> findMinHeightTrees(int n, int[][] edges) {
            List<Integer> list=new ArrayList<>();
        for (int i = 0; i < n; i++) {
           deepBS(list,i,edges);
        }
        return null;
    }

    private void deepBS(List<Integer> list, int i, int[][] edges) {
        int [][] copyArray=Arrays.copyOf(edges,edges.length);
        for (int j = 0; j < edges.length; j++) {
            if(edges[j][0]==i){

            }

        }
    }

    public static void main(String[] args) {
        int[][] edges=new int[][]{{1,2},{2,3},{4,7}};
        int [][] copyArray=Arrays.copyOf(edges,edges.length);
        System.out.println(copyArray);
    }
}
